An Iterative Three-Stage Neighborhood Search for Solving Precedence Constrained Agricultural Land Investment Problem
نویسندگان
چکیده
The use of neighborhood search techniques to address a practical issue faced by agricultural investors is examined in this study. problem named as land investment with precedence constraints and it has an essential impact on agriculture issues. tackled can be viewed variant the well-known classical 0-1 knapsack where are imposed pairs items. Precedence take into account relation between This paper first simulates considered presents mathematical representation model. Then, iterative three-stage method proposed for optimizing problem. consists three stages. First stage applies greedy procedure order construct feasible solution. Second local procedures enhance quality solutions at hand. Third last, broaden space, random destruction approach introduced. Finally, effectiveness suggested assessed contrasted outcomes obtained techniques. presented competitive efficient since produces excellent reasonable amount time.
منابع مشابه
A Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملA Variable Neighborhood Search for Solving the Linear Ordering Problem
A Systematic change of Neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization. In this paper we present a Variable Neighborhood Search implementation designed to find high quality solutions for the NP-hard Linear Ordering Problem, which has a significant number of application in practice, such triang...
متن کاملVariable Neighborhood Search for solving Bandwidth Coloring Problem
This paper presents a variable neighborhood search (VNS) algorithm for solving bandwidth coloring problem (BCP) and bandwidth multicoloring problem (BMCP). BCP and BMCP are generalizations of the well known vertex coloring problem and they are of a great interest from both theoretical and practical points of view. Presented VNS combines a shaking procedure which perturbs the colors for an incre...
متن کاملVariable Neighborhood Search for Solving the Balanced Location Problem
In this paper we propose a general variable neighborhood search approach for the balanced location problem. Next to large shaking neighborhoods, the embedded variable neighborhood descent utilizes three neighborhood structures that focus on different solution aspects. By a computational study, we show that this VNS outperforms existing methods with respect to average solution quality and stabil...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of mechanical, civil and industrial engineering
سال: 2023
ISSN: ['2710-1436']
DOI: https://doi.org/10.32996/jmcie.2023.4.2.6